An Exact Algorithm for Minimum Distortion Embedding
نویسندگان
چکیده
Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.
منابع مشابه
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
We study the problem of finding a minimum-distortion embedding of the shortest path metric of an unweighted graph into a “simpler” metric X. Computing such an embedding (exactly or approximately) is a non-trivial task even when X is the metric induced by a path, or, equivalently, into the real line. In this paper we give approximation and fixed-parameter tractable (FPT) algorithms for minimum-d...
متن کاملModel Based Method for Determining the Minimum Embedding Dimension from Solar Activity Chaotic Time Series
Predicting future behavior of chaotic time series system is a challenging area in the literature of nonlinear systems. The prediction's accuracy of chaotic time series is extremely dependent on the model and the learning algorithm. On the other hand the cyclic solar activity as one of the natural chaotic systems has significant effects on earth, climate, satellites and space missions. Several m...
متن کاملComputational metric embeddings
We study the problem of computing a low-distortion embedding between two metric spaces. More precisely given an input metric space M we are interested in computing in polynomial time an embedding into a host space M ′ with minimum multiplicative distortion. This problem arises naturally in many applications, including geometric optimization, visualization, multi-dimensional scaling, network spa...
متن کاملBandwidth and Distortion Revisited
In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the BANDWIDTH problem) and for finding an embedding of a given graph into a line that minimizes distortion (the DISTORTION problem). For both problems we develop algorithms that work in O(9.363) time and polynomial space. For BANDWIDTH, this improves O(10...
متن کاملOptimal look-up table-based data hiding
In this study, the authors present a novel data hiding scheme using the minimum distortion look-up table (LUT) embedding that achieves good distortion-robustness performance. LUT-based data hiding is a simple and efficient way to embed information into multimedia content for various applications, such as transaction tracking and database annotation. The authors find it possible to optimally red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2009